منابع مشابه
On Parallel Array P Systems
We further investigate the parallel array P systems recently introduced by K.G. Subramanian, P. Isawasan, I. Venkat, and L. Pan. We first make explicit several classes of parallel array P systems (with one or more axioms, with total or maximal parallelism, with rules of various types). In this context, some results from the above mentioned paper by Subramanian et al. are improved. A series of o...
متن کاملParallel Array-rewriting P Systems
A variant of array-rewriting P systems that uses parallel rewriting of arrays in the regions is introduced. The generative power of this model is compared with certain array grammars generating array languages. It is shown that geometric arrays such as hollow rectangles and hollow squares can be generated by parallel array P systems with a priority relation on the rules. The advantage of the pr...
متن کاملArray Insertion and Deletion P Systems
Let d ∈ N; then a d-dimensional array A over an alphabet V is a function A : Z → V ∪ {#}, where shape (A) = { v ∈ Z | A (v) 6= # } is finite and # / ∈ V is called the background or blank symbol. The set of all d-dimensional arrays over V is denoted by V ∗d. For v ∈ Z, v = (v1, . . . , vd), the norm of v is ‖v‖ = max {|vi| | 1 ≤ i ≤ d}. The translation τv : Z → Z is defined by τv (w) = w+ v for ...
متن کاملP Systems for Array Generation and Application to Kolam Patterns
In the area of membrane computing, a new computability model, now called P system was introduced by PAUN (2002) inspired from the cell structure and its functioning. One area of P systems deals with string objects and rewriting rules. Recently, array P systems with array objects and array rewriting rules were introduced. Here we introduce a new class of array P systems called sequential/paralle...
متن کاملOne-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules
We consider the (one-dimensional) array counterpart of contextual as well as insertion and deletion string grammars and consider the operations of array insertion and deletion in array grammars. First we show that the emptiness problem for P systems with (one-dimensional) insertion rules is undecidable. Then we show computational completeness of P systems using (one-dimensional) array insertion...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2009
ISSN: 0169-2968
DOI: 10.3233/fi-2009-0037